On the gap between separating words and separating their reversals
نویسنده
چکیده
A deterministic finite automaton (DFA) separates two strings w and x if it accepts w and rejects x. The minimum number of states required for a DFA to separate w and x is denoted by sep(w, x). The present paper shows that the difference ∣∣sep(w, x)− sep(w, xR)∣∣ is unbounded for a binary alphabet; here w stands for the mirror image of w. This solves an open problem stated in [Demaine, Eisenstat, Shallit, Wilson: Remarks on separating words. DCFS 2011. LNCS vol. 6808, pp. 147-157.]
منابع مشابه
The effects of suspending medium on dielectrophoretic systems for separating and sorting carbon nanotubes
The separation of two different types of multi-walled carbon nanotubes is studied in a dielectrophoresis-based microchannel system in seven different solvents as the suspending medium. A simple model was developed to predict the behavior of the multi-walled carbon nanotubes in the above mentioned system. Then, the equations of motion for the multi-walled carbon nanotubes in that system were in...
متن کاملBanach module valued separating maps and automatic continuity
For two algebras $A$ and $B$, a linear map $T:A longrightarrow B$ is called separating, if $xcdot y=0$ implies $Txcdot Ty=0$ for all $x,yin A$. The general form and the automatic continuity of separating maps between various Banach algebras have been studied extensively. In this paper, we first extend the notion of separating map for module case and then we give a description of a linear se...
متن کاملEfficiency Analysis Based on Separating Hyperplanes for Improving Discrimination among DMUs
Data envelopment analysis (DEA) is a non-parametric method for evaluating the relative technical efficiency for each member of a set of peer decision making units (DMUs) with multiple inputs and multiple outputs. The original DEA models use positive input and output variables that are measured on a ratio scale, but these models do not apply to the variables in which interval scale data can appe...
متن کاملRemarks on Separating Words
The separating words problem asks for the size of the smallest DFA needed to distinguish between two words of length ≤ n (by accepting one and rejecting the other). In this paper we survey what is known and unknown about the problem, consider some variations, and prove several new results.
متن کاملSeparating indexes from data: a distributed scheme for secure database outsourcing
Database outsourcing is an idea to eliminate the burden of database management from organizations. Since data is a critical asset of organizations, preserving its privacy from outside adversary and untrusted server should be warranted. In this paper, we present a distributed scheme based on storing shares of data on different servers and separating indexes from data on a distinct server. Shamir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 711 شماره
صفحات -
تاریخ انتشار 2018